Power Domination in Product Graphs

The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dominating sets in graphs. The power domination number γP (G) of G is the minimum cardinality of a power dominating set. Dorfling and Henning [2] determined the power domination number of the Cartesian product of paths. In this paper the power domination number is determined for all direct products of paths except for the odd component of the direct product of two odd paths. For instance, if n is even and C a connected component of Pm ×Pn, where m is odd or m ≥ n, then γP (C) = ⌈n/4⌉. For the strong product we prove that γP (Pn ⊠ Pm) = max{⌈n/3⌉, ⌈(n + m − 2)/4⌉}, unless 3m − n − 6 ≡ 4 (mod 8). The power domination number is also determined for an arbitrary lexicographic product.